A BDDC Method for Mortar Discretizations Using a Transformation of Basis

نویسندگان

  • Hyea Hyun Kim
  • Maksymilian Dryja
  • Olof B. Widlund
چکیده

A BDDC (balancing domain decomposition by constraints) method is developed for elliptic equations, with discontinuous coefficients, discretized by mortar finite element methods for geometrically nonconforming partitions in both two and three space dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face, which is the intersection of the boundaries of a pair of subdomains. A condition number bound of the form C maxi{(1 + log(Hi/hi))} is established under certain assumptions on the geometrically nonconforming subdomain partition in the three-dimensional case. Here Hi and hi are the subdomain diameters and the mesh sizes, respectively. In the geometrically conforming case and the geometrically nonconforming cases in two dimensions, no assumptions on the subdomain partition are required. This BDDC preconditioner is also shown to be closely related to the Neumann–Dirichlet version of the FETI-DP algorithm. The results are illustrated by numerical experiments which confirm the theoretical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bddc Algorithm for Problems with Mortar Discretization

Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elliptic problems with mortar discretizations for geometrically non-conforming partitions in both two and three spatial dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face which is an intersection of the boundaries of a pair of subdomains...

متن کامل

A Three-Level BDDC Algorithm for Mortar Discretizations

In this talk, three-level BDDC algorithms will be presented for the solutions of large sparse linear algebraic systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In the algorithms, the large coarse problems from two-level BDDC algorithms are solved approximately while a...

متن کامل

A BDDC Algorithm for Mortar Discretization of Elasticity Problems

Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elasticity problems in three dimensions with mortar discretization on geometrically nonconforming subdomain partitions. Coarse basis functions in the BDDC algorithm are constructed from primal constraints on faces. These constrains are similar to the average matching condition and the moment matching con...

متن کامل

UN CO RR EC TE D PR O O F 1 BDDC for Higher - Order Discontinuous Galerkin 2 Discretizations 3

A Balancing Domain Decomposition by Constraints (BDDC) method is presented 13 for the solution of a discontinuous Galerkin (DG) discretization of a second-order 14 elliptic problem in two dimensions. BDDC was originally introduced in [8] for the 15 solution of continuous finite element discretizations. Mandel and Dohrmann [13] 16 later proved a condition number bound of κ ≤ C(1 + log(H/h))2 for...

متن کامل

A Unified Analysis of Balancing Domain Decomposition by Constraints for Discontinuous Galerkin Discretizations

The BDDC algorithm is extended to a large class of discontinuous Galerkin (DG) discretizations of second order elliptic problems. An estimate of C(1 + log(H/h)) is obtained for the condition number of the preconditioned system where C is a constant independent of h or H or large jumps in the coefficient of the problem. Numerical simulations are presented which confirm the theoretical results. A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2008